Convex Polytopes All of Whose Reverse Lexicographic Initial Ideals Are Squarefree

نویسندگان

  • HIDEFUMI OHSUGI
  • TAKAYUKI HIBI
چکیده

A compressed polytope is an integral convex polytope any of whose reverse lexicographic initial ideals is squarefree. A sufficient condition for a (0, 1)-polytope to be compressed will be presented. One of its immediate consequences is that the class of compressed (0, 1)-polytopes includes (i) hypersimplices, (ii) order polytopes of finite partially ordered sets, and (iii) stable polytopes of perfect graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quadratic Gröbner Bases Arising from Partially Ordered Sets

The order polytope O(P ) and the chain polytope C(P ) associated to a partially ordered set P are studied. In this paper, we introduce the convex polytope Γ(O(P ),−C(Q)) which is the convex hull of O(P ) ∪ (−C(Q)), where both P and Q are partially ordered sets with |P | = |Q| = d. It will be shown that Γ(O(P ),−C(Q)) is a normal and Gorenstein Fano polytope by using the theory of reverse lexico...

متن کامل

Reverse Lexicographic and Lexicographic Shifting

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆lex — an operation that transforms a monomial ideal of S = k[xi : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a ...

متن کامل

ar X iv : m at h / 05 07 56 5 v 1 [ m at h . C O ] 2 7 Ju l 2 00 5 REVERSE LEXICOGRAPHIC AND LEXICOGRAPHIC SHIFTING

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, ∆ lex — an operation that transforms a monomial ideal of S = k[x i : i ∈ N] that is finitely generated in each degree into a squarefree strongly stable ideal — is defined and studied. It is proved that (in contrast to the reverse lexicographic case) ...

متن کامل

Reverse Lexicographic Initial Ideals of Generic Ideals Are Nitely Generated

This article generalizes the well-known notion of generic forms to the algebra R 0 , introduced in 27]. For the total degree, then reverse lexicographic order, we prove that the initial ideal of an ideal generated by nitely many generic forms (in countably innnitely many variables) is nitely generated. This contrasts to the lexicographic order, for which initial ideals of generic ideals in gene...

متن کامل

Ideals with Maximal Local Cohomology Modules

This paper finds its motivation in the pursuit of ideals whose local cohomology modules have maximal Hilbert functions. In [8], [9] we proved that the lexicographic (resp. squarefree lexicographic) ideal of a family of graded (resp. squarefree) ideals with assigned Hilbert function provides sharp upper bounds for the local cohomology modules of any of the ideals of the family. Moreover these bo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001